Computing an Approximate Inverse Preconditioner by Successive Approximations Method
نویسندگان
چکیده
Abstract A method for computing an approximate inverse preconditioner of a matrix A which all eigenvalues have negative real parts is proposed. The approximate solution of the special Sylvester matrix equation AX+ XA = I, which is an approximate inverse preconditioner of matrix A, is obtaining by the successive approximations method. Some numerical experiments on test matrices from Harwell-Boing collection for comparing the numerical performance of the new method with an available well-known algorithm are presented.
منابع مشابه
Complete pivoting strategy for the $IUL$ preconditioner obtained from Backward Factored APproximate INVerse process
In this paper, we use a complete pivoting strategy to compute the IUL preconditioner obtained as the by-product of the Backward Factored APproximate INVerse process. This pivoting is based on the complete pivoting strategy of the Backward IJK version of Gaussian Elimination process. There is a parameter $alpha$ to control the complete pivoting process. We have studied the effect of dif...
متن کاملA Sparse Approximate Inverse Preconditioner for the Conjugate Gradient Method
A method for computing a sparse incomplete factorization of the inverse of a symmetric positive definite matrix A is developed, and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient calculations. It is proved that in exact arithmetic the preconditioner is well defined if A is an H-matrix. The results of numerical experiments are pre...
متن کاملMSP: A Class of Parallel Multistep Successive Sparse Approximate Inverse Preconditioning Strategies
We develop a class of parallel multistep successive preconditioning strategies to enhance efficiency and robustness of standard sparse approximate inverse preconditioning techniques. The key idea is to compute a series of simple sparse matrices to approximate the inverse of the original matrix. Studies are conducted to show the advantages of such an approach in terms of both improving precondit...
متن کاملApproximate Inverse Preconditioning of Iterative Methods for Nonsymmetric Linear Systems
A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods. 1. Introduction. We describe a method for computing an incomplete factorization of the inverse of a general sparse matrix A 2 IR nn. The resulting...
متن کاملA Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
This paper is concerned with a new approach to preconditioning for large sparse linear systems A procedure for computing an incomplete factorization of the inverse of a nonsymmetric matrix is developed and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient type methods Some theoretical properties of the preconditioner are discussed a...
متن کامل